Moving least-square method in learning theory
نویسندگان
چکیده
منابع مشابه
Moving Least Square Reproducing Kernel Method ( III ) : Wavelet Packet & Its
This work is a natural extension of the work done in Part II of this series. A new partition of unity | the synchronized reproducing kernel (SRK) interpolant|is proposed within the framework of moving least square reproducing kernel representation. It is a further development and generalization of the reproducing kernel particle method (RKPM), which demonstrates some superior computational capa...
متن کاملMoving least-square reproducing kernel method Part II: Fourier analysis
In Part I of this work, the moving least-square reproducing kernel (MLSRK) method is formulated and implemented. Based on its generic construction, an m-consistency structure is discovered and the convergence theorems are established. In this par\ of the work, a systematic Fourier analysis is employed to evaluate and further establish the method. The preliminary Fourier analysis reveals that th...
متن کاملLeast Square Method Based Evolutionary Neural Learning Algorithm
In this paper, we present a new idea of evolving weights for the Artijicial Neural Networks (ANNs). We propose a novel hybrid learning approach for the training of a feed-forward ANN. The approach combines evolutionary algorithms with matrix solution methods such as GramSchmidt etc., to achieve optimum weights for hidden and output layers. Our hybrid method is to apply the evolutionary algorith...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملA meshless Galerkin method with moving least square approximations for infinite elastic solids∗
Combining moving least square approximations and boundary integral equations, a meshless Galerkin method, which is the Galerkin boundary node method (GBNM), for twoand three-dimensional infinite elastic solid mechanics problems with traction boundary conditions is discussed. In this numerical method, the resulting formulation inherits the symmetry and positive definiteness of variational proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2010
ISSN: 0021-9045
DOI: 10.1016/j.jat.2009.12.002